
/*
*Pool Public Licence version 0.1 or later
*Released on 20th April 2008.
*Any voilations can be repoted at paritosh@wikiocean.net
*What is treated as voilations can be found at www.wikiocean.net/ppl1-voilations* 
******************************************************************************
* The contents of this file are subject Affero GPL v3 and later with additional conditions.
* The additional conditions are to be considered as part of the Affero GPL v3 and later.
* The additional conditions will supersede the Affero GPLv3 and later in case of conflict.
* ("License"); You may not use this file except in compliance with the License
* You may obtain a copy of the License at http://www.gnu.org/licenses/agpl.html
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
* the specific language governing rights and limitations under the License.
* The Initial Developer of the Original Code is Paritosh Pungaliya.
* created by Paritosh Pungaliya are Copyright (C) Paritosh Pungaliya; All Rights Reserved.
* Contributions are Copyright (C) 2001-2008 Paritosh Pungaliya.

* Objective of the additional terms (license) 
* 1) Is to extend the software freedom to freedom to work.
* 2) To ensure that knowledge is free from monopoly of agencie(s).
* 3) To avoid a situation where big corporates or investors can buy out free software groups and companies and then start milking the communities built around it.
* (this trend can be seen how the openness changes in companies that get Venture Capital funding.)
* (if you agree to this logic I invite you to our group to work together)

* Additional conditions
*  0) Source code will also include
* 	a) data dictionaries, data ontologies which are used to alter the behavior of code or to control           the features of application.
* 	b) Any code generated or derived automatically or manually from this code or logic
*  1) The revenue generated by deploying, implementing , selling services and other activities
*  	 based on this source code should be shared 100%, between the people working on it.
*  2) Capital invested should be given only fixed rate of return or linked to revenue/surplus growth for limited time.
*  3) People working on the project should always have an option to replace the capital provider in full or part with lower cost capital.
*  4) Their should not be any ownership which can be sold as a claim on future profit to be generated from the work of people working on the code.
*  5) Brand thus generated should belong to the group.
*  6) For old and new members revenue sharing should be equal for same work equivalent.
*  7) The share of revenue should be decided by bidding for work before allocation of work within the group.
*  8) Before bidding various method of measuring the work should be clearly defined and published in public domain. Any change in process should also be publised in public domain imediately.
*  9) All data related to to revenue sharing should be published as and when generated in public domain.
*  10) For group of people having size more than 10 people will have to make it open online for others to participate in bids. 
*  11) All people involved in related and sub project will be treated as a group.
*  12) Once this license is being used for a certain code then all and any other software services being provided by the group should complusorilly come under 100% revenue sharing.
*  13) Cross subsidization should not happen under this revenue share, no additional benefit should be drawn from the people, by the employing agency.
*  14) Any position or knowledge or legal structure created relating to people working on code, which adversely affects the spirit of 100% revenue share will be treated as a violation.
*  15) Revenue sharing defined.
*     a) includes direct revenue and also intangible gains like brand, and organization.
*     b) No personal judgment should be involved in judging the distribution of revenue.It has to be pre-defined formula based.
*     c)100% of revenue should be shared before expenses and recievers should have control over what expenses to incur.
*     d)For the work done in any month by contributing group member, working on any project can be given revenue share from the work done by the group, for a maximum of 18 months after that month.
*     e)Revenue should be apportioned to the month in which work is done and not when received.
*  The group fulfilling the above conditions also has to be a wiki ecosystem further defined in www.wekosystem.org or read about Wekosystem at www.wikiocean.net

*  ******************************************************************************
*/  
package combinereport.query;

import java.util.Vector;

import sort.Ascending;
import utility.Input;

public class MergedBuffer
{
  public static void main(String[] args)
  {
  	//String[] buffer1={"Name	code","Adobe	aaa","Microsoft	mmm"};
	//String[] buffer2={"Productcode	points	Grade	city","aaa	2000	B	pune","mmm	30000	A	Mumbai","sss	4000	C	delhi","nnn	5000	D	pune","itt	6000"};//};
	
	String[] buffer1={"Name	code","Adobe	aaa","Microsoft	mmm","Netscape	nnn","IBM	iii"};
	String[] buffer2={"Productcode	points	Grade	city","mmm	30000	A	Mumbai","nnn	4000	C	delhi","sss	5000	D	pune","ttt	6000"};//};
	
	Vector<Object>Vector1=new Vector<Object>();
	Vector<Object>Vector2=new Vector<Object>();
	Vector1.add("1");
	Vector2.add("0");
	Ascending asc=new Ascending();
	asc.setbuffer(buffer1);
	//asc.setVector(Vector1);
	asc.getResult();
	buffer1=asc.getbuffer();
	asc.setbuffer(buffer2);
	//asc.setVector(Vector2);
	asc.getResult();
	buffer2=asc.getbuffer();
	MergedBuffer merg = new MergedBuffer();
	StringBuffer mergedBuffer=merg.outerMergedBuffer(buffer1,buffer2,1,0);
	System.out.println(mergedBuffer.toString());
  }
	
	public StringBuffer createMergedBuffer(String[] buffer1, String[] buffer2,int index1,int index2) 
	{
		StringBuffer mergeStrings = new StringBuffer();
		String strFields=buffer1[0].concat("\t"+replaceAtIndex(buffer2[0], index2));
		mergeStrings.append(strFields+Input.ENDSEPARATOR);
		
			int i=1;
			int j=1;
			String str1;
			String str2;
				
				while(i<buffer1.length+1 && j<buffer2.length+1)
				{
					try 
					{
						String[] split1=buffer1[i].split("\t");		
						str1 = split1[index1];
						
						String[] split2=buffer2[j].split("\t");
						str2 = split2[index2];
						if(str1.compareTo(str2)==0)
						{	
							String st="";
							st=replaceAtIndex(buffer2[j],index2);
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);
							System.out.println(mergeStrings);
							i++;
							String splitbuffer[] = buffer1[i].split("\t");
							String nextvalue=splitbuffer[index1];
							if(nextvalue.equals(str1))
								j--;
							j++;
							splitbuffer = buffer2[i].split("\t");
							nextvalue=splitbuffer[index2];
							if(nextvalue.equals(str2))
								i--;

						}
						else if(str1.compareTo(str2)<0)
						{
							i++;
						}
						else if(str1.compareTo(str2)>0)
						{
							j++;
						}
					
					}
					catch (Exception e) 
					{
						break;
					}
				}
				System.out.println(mergeStrings.toString());
				return mergeStrings;
	}
	public StringBuffer leftMergedBuffer(String[] buffer1, String[] buffer2,int index1,int index2) 
	{
		StringBuffer mergeStrings = new StringBuffer();
		String strFields=buffer1[0].concat("\t"+replaceAtIndex(buffer2[0], index2));
		mergeStrings.append(strFields+Input.ENDSEPARATOR);
		System.out.println(strFields);
		
			int i=1;
			int j=1;
			String str1;
			String str2;
				
				while(i<buffer1.length+1 && j<buffer2.length+1)
				{
					try 
					{
						String[] split1=buffer1[i].split("\t");		
						str1 = split1[index1];
						
						String[] split2=buffer2[j].split("\t");
						str2 = split2[index2];
						if(str1.compareTo(str2)==0)
						{	
							String st="";
							st=replaceAtIndex(buffer2[j],index2);
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);
							System.out.println(mergeStrings);
							i++;
							String splitbuffer[] = buffer1[i].split("\t");
							String nextvalue=splitbuffer[index1];
							if(nextvalue.equals(str1))
								j--;
							j++;
							splitbuffer = buffer2[i].split("\t");
							nextvalue=splitbuffer[index2];
							if(nextvalue.equals(str2))
								i--;

						}
						else if(str1.compareTo(str2)<0)
						{
							String st="";
							for(int k=0;k<split2.length;k++)
									st = st+"null\t";
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);							
							i++;
						}
						else if(str1.compareTo(str2)>0)
						{
							j++;
						}
					
					}
					catch (Exception e) 
					{
						break;
					}
				}
				System.out.println(mergeStrings.toString());
				return mergeStrings;
	}
	public StringBuffer rightMergedBuffer(String[] buffer2, String[] buffer1,int index2,int index1)
	{
		StringBuffer mergeStrings = new StringBuffer();
		String strFields=buffer1[0].concat("\t"+replaceAtIndex(buffer2[0], index2));
		mergeStrings.append(strFields+Input.ENDSEPARATOR);
		System.out.println(strFields);
		
			int i=1;
			int j=1;
			String str1;
			String str2;
				
				while(i<buffer1.length+1 && j<buffer2.length+1)
				{
					try 
					{
						String[] split1=buffer1[i].split("\t");		
						str1 = split1[index1];
						
						String[] split2=buffer2[j].split("\t");
						str2 = split2[index2];
						if(str1.compareTo(str2)==0)
						{	
							String st="";
							st=replaceAtIndex(buffer2[j],index2);
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);
							System.out.println(mergeStrings);
							i++;
							String splitbuffer[] = buffer1[i].split("\t");
							String nextvalue=splitbuffer[index1];
							if(nextvalue.equals(str1))
								j--;
							j++;
							splitbuffer = buffer2[j].split("\t");
							nextvalue=splitbuffer[index2];
							if(nextvalue.equals(str2))
								i--;

						}
						else if(str1.compareTo(str2)<0)
						{
							
							i++;
						}
						else if(str1.compareTo(str2)>0)
						{
							String nextvalue="";
							try {
								int t =j+1;
								String splitbuffer[] = buffer2[t].split("\t");
								nextvalue = splitbuffer[index2];
							} catch (Exception e) {
								String st="";
								for(int k=0;k<split2.length;k++)
										st = st+"null\t";
								for(int l=i;l<buffer1.length;i++)
								{
									String str=buffer1[i].concat("\t"+st);
									mergeStrings.append(str+Input.ENDSEPARATOR);
								}
								i=buffer1.length;
								j++;
							}
							if(nextvalue.compareTo(str2)>0)
								j++;
							else
							{
								String st="";
								for(int k=0;k<split2.length;k++)
										st = st+"null\t";
								String str=buffer1[i].concat("\t"+st);
								mergeStrings.append(str+Input.ENDSEPARATOR);				
								
							}
						}
					
					}
					catch (Exception e) 
					{
						e.printStackTrace();
						break;
					}
				}
				System.out.println(mergeStrings.toString());
				return mergeStrings;
	
	}
	public StringBuffer outerMergedBuffer(String[] buffer1, String[] buffer2,int index1,int index2) 
	{
		StringBuffer mergeStrings = new StringBuffer();
		String strFields=buffer1[0].concat("\t"+replaceAtIndex(buffer2[0], index2));
		mergeStrings.append(strFields+Input.ENDSEPARATOR);
		
			int i=1;
			int j=1;
			String str1;
			String str2;
				
				while(i<buffer1.length+1 && j<buffer2.length+1)
				{
					try 
					{
						String[] split1=buffer1[i].split("\t");		
						str1 = split1[index1];
						
						String[] split2=buffer2[j].split("\t");
						str2 = split2[index2];
						if(str1.compareTo(str2)==0)
						{	
							String st="";
							st=replaceAtIndex(buffer2[j],index2);
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);
							System.out.println(mergeStrings);
							i++;
							String splitbuffer[] = buffer1[i].split("\t");
							String nextvalue=splitbuffer[index1];
							if(nextvalue.equals(str1))
								j--;
							j++;
							splitbuffer = buffer2[i].split("\t");
							nextvalue=splitbuffer[index2];
							if(nextvalue.equals(str2))
								i--;

						}
						else if(str1.compareTo(str2)<0)
						{
							String st="";
							for(int k=0;k<split2.length;k++)
									st = st+"null\t";
							String str=buffer1[i].concat("\t"+st);
							mergeStrings.append(str+Input.ENDSEPARATOR);							
							i++;
							
						}
						else if(str1.compareTo(str2)>0)
						{
							j++;
						}
					
					}
					catch (Exception e) 
					{
						if(i==buffer1.length)
						{
							String str="";
							String splibuffer[] =buffer1[0].split("\t"); 
							for(int k=0;k<splibuffer.length;k++)
								str=str + "null\t";
							for(int k=j;k<buffer2.length;k++)
								mergeStrings.append(str+buffer2[k]+Input.ENDSEPARATOR);
						}
						else if(j==buffer2.length)
						{
							String str="";
							String splibuffer[] =buffer2[0].split("\t"); 
							for(int k=0;k<splibuffer.length;k++)
								str=str + "null\t";
							for(int k=i;k<buffer1.length;k++)
								mergeStrings.append(buffer1[k]+str+Input.ENDSEPARATOR);
						}	
						break;
					}
				}
				System.out.println(mergeStrings.toString());
				return mergeStrings;
	
		
	}
	private String replaceAtIndex(String str, int index2)
	{
	
		String[] strBuff=str.split("\t");
		str="";
		int l=0;
		for(l=0;l<strBuff.length-1;l++)
		{
			if(l!=index2)
			{
				str=str+strBuff[l]+"\t";
			}
			
		}
		str=str+strBuff[l];
		return str; 
	}
	
}



